Non-deterministic weighted automata evaluated over Markov chains
نویسندگان
چکیده
منابع مشابه
Random Generation of Deterministic Acyclic Automata Using Markov Chains
In this article we propose an algorithm, based on Markov chain techniques, to generate random automata that are deterministic, accessible and acyclic. The distribution of the output approaches the uniform distribution on n-state such automata. We then show how to adapt this algorithm in order to generate minimal acyclic automata with n states almost uniformly.
متن کاملHyper-minimisation of deterministic weighted nite automata over semi elds
Hyper-minimisation of deterministic nite automata is a recently introduced state reduction technique that allows a nite change in the recognised language. A generalisation of this lossy compression method to the weighted setting over semi elds is presented, which allows the recognised formal power series to di er for nitely many input strings. First, the structure of hyper-minimal deterministic...
متن کاملHyper-minimisation of deterministic weighted finite automata over semifields
Hyper-minimisation of deterministic finite automata is a recently introduced state reduction technique that allows a finite change in the recognised language. A generalisation of this lossy compression method to the weighted setting over semifields is presented, which allows the recognised formal power series to differ for finitely many input strings. First, the structure of hyper-minimal deter...
متن کاملMinimizing Deterministic Weighted Tree Automata
The problem of efficiently minimizing deterministic weighted tree automata (wta) is investigated. Such automata have found promising applications as language models in Natural Language Processing. A polynomial-time algorithm is presented that given a deterministic wta over a commutative semifield, of which all operations including the computation of the inverses are polynomial, constructs an eq...
متن کاملPattern Markov Chains: Optimal Markov Chain Embedding through Deterministic Finite Automata
In the framework of patterns in random texts, the Markov chain embedding techniques consist of turning the occurrences of a pattern over an order-m Markov sequence into those of a subset of states into an order-1 Markov chain. In this paper we use the theory of language and automata to provide space-optimal Markov chain embedding using the new notion of pattern Markov chains (PMCs), and we give...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2020
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2019.10.001